Minimal Connections: the Classical Steiner Problem and Generalizations Connessioni Minime: Il Problema Classico Di Steiner E Generalizzazioni
نویسنده
چکیده
The classical Steiner problem is the problem of finding the shortest graph connecting a given finite set of points. In this seminar we review the classical problem and introduce a new, generalized formulation, which extends the original one to infinite sets in metric spaces. Sunto. Il problema classico di Steiner richiede di determinare il grafo di lunghezza minimica che connette un dato insieme finito di punti. In questo seminario rivedremo il problema classico e introdurremo una nuova formulazione piuú generale che estende il problema originario a insiemi anche infiniti in spazi metrici. 2010 MSC. 30L99; 05C63.
منابع مشابه
Nordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملOtimização do Projeto de Redes Urbanas Baseado no Problema de Steiner
Resumo: Este trabalho apresenta uma proposta para a otimização do projeto de vários tipos de redes urbanas, como, por exemplo, redes de telecomunicações, que freqüentemente vêm sendo representadas em sistemas GIS, onde a rede pode ser modelada como um problema de Steiner. Propõe-se que este problema de otimização seja resolvido em duas etapas, onde, na primeira etapa, executa-se o pré-processam...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملTwo Heuristics for the Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an efficient method for computing a locally optimal tree with a given topol...
متن کاملThe Steiner problem for infinitely many points
Let A be a given compact subset of the euclidean space. We consider the problem of finding a compact connected set S of minimal 1dimensional Hausdorff measure, among all compact connected sets containing A. We prove that when A is a finite set any minimizer is a finite tree with straight edges, thus recovery the classical Steiner Problem. Analogously, in the case when A is countable, we prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013